Search results for "Family of curves"

showing 10 items of 11 documents

On the minimal number of singular fibers with non-compact Jacobians for families of curves over P1

2016

Abstract Let f : X → P 1 be a non-isotrivial family of semi-stable curves of genus g ≥ 1 defined over an algebraically closed field k. Denote by s nc the number of the singular fibers whose Jacobians are non-compact. We prove that s nc ≥ 5 if k = C and g ≥ 5 ; we also prove that s nc ≥ 4 if char ( k ) > 0 and the relative Jacobian of f is non-smooth.

0301 basic medicineDiscrete mathematicsPure mathematicsApplied MathematicsGeneral Mathematics010102 general mathematics01 natural sciences03 medical and health sciencessymbols.namesakeMathematics::Algebraic Geometry030104 developmental biologyGenus (mathematics)Jacobian matrix and determinantFamily of curvessymbols0101 mathematicsAlgebraically closed fieldMathematicsJournal de Mathématiques Pures et Appliquées
researchProduct

Convexly generic curves in R 3

1988

We study curves immersed in R 3, with special interest in the description of their convex hull frontier structure from a global viewpoint. Genericity conditions are set for these curves by looking at the singularities of height functions on them. We define panel structures for convexly generic curves and work out numerical relations involving the number of tritangent support planes. As a consequence, a generic version of the 4-vertex theorem for convex curves in R 3 is obtained.

Convex hullPure mathematicsDifferential geometryHyperbolic geometryFamily of curvesRegular polygonConvex setGeometryGeometry and TopologyAlgebraic geometryMathematicsProjective geometryGeometriae Dedicata
researchProduct

Exact, efficient, and complete arrangement computation for cubic curves

2006

AbstractThe Bentley–Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and efficient algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and Bézier curves.The algorithm is complete in that it handles all possible degeneracies such as tangential intersections and singularities. It is exact in t…

Discrete mathematicsArrangementsControl and OptimizationComputationAlgebraic curvesMathematical analysisBézier curveSweep line algorithmComputer Science ApplicationsModuli of algebraic curvesComputational MathematicsGeometric designComputational Theory and MathematicsFamily of curvesSweep-line algorithmExact geometric computationGeometric primitiveAlgebraic curveGeometry and TopologyRobustnessComputingMethodologies_COMPUTERGRAPHICSMathematicsComputational Geometry
researchProduct

An exact, complete and efficient implementation for computing planar maps of quadric intersection curves

2005

We present the first exact, complete and efficient implementation that computes for a given set P=p1,...,pn of quadric surfaces the planar map induced by all intersection curves p1∩ pi, 2 ≤ i ≤ n, running on the surface of p1. The vertices in this graph are the singular and x-extreme points of the curves as well as all intersection points of pairs of curves. Two vertices are connected by an edge if the underlying points are connected by a branch of one of the curves. Our work is based on and extends ideas developed in [20] and [9].Our implementation is complete in the sense that it can handle all kind of inputs including all degenerate ones where intersection curves have singularities or pa…

Discrete mathematicsCombinatoricssymbols.namesakeGeometric designQuadricDegenerate energy levelsAlgebraic surfaceFamily of curvessymbolsGravitational singularityAlgebraic curveMathematicsPlanar graphProceedings of the twenty-first annual symposium on Computational geometry
researchProduct

Complete, exact, and efficient computations with cubic curves

2004

The Bentley-Ottmann sweep-line method can be used to compute thearrangement of planar curves provided a number of geometricprimitives operating on the curves are available. We discuss themathematics of the primitives for planar algebraic curves of degreethree or less and derive efficient realizations. As a result, weobtain a complete, exact, and efficient algorithm for computingarrangements of cubic curves. Conics and cubic splines are specialcases of cubic curves. The algorithm is complete in that it handles all possibledegeneracies including singularities. It is exact in that itprovides the mathematically correct result. It is efficient in thatit can handle hundreds of curves with a quart…

Discrete mathematicsModuli of algebraic curvesGeometric designConic sectionComputationFamily of curvesApplied mathematicsGravitational singularityAlgebraic curveSweep line algorithmMathematicsProceedings of the twentieth annual symposium on Computational geometry
researchProduct

Elementary (-1)-curves of P-3

2006

In this note we deal with rational curves in P^3 which are images of a line by means of a finite sequence of cubo-cubic Cremona transformations. We prove that these curves can always be obtained applying to the line a sequence of such transformations increasing at each step the degree of the curve. As a corollary we get a result about curves that can give speciality for linear systems of P^3.

Discrete mathematicsSequenceAlgebra and Number TheoryDegree (graph theory)Linear system14C20Finite sequenceMathematics - Algebraic GeometryCorollaryLinear systems fat pointsFamily of curvesLine (geometry)FOS: MathematicsSettore MAT/03 - GeometriaAlgebraic Geometry (math.AG)Computer Science::DatabasesMathematics
researchProduct

Curve packing and modulus estimates

2018

A family of planar curves is called a Moser family if it contains an isometric copy of every rectifiable curve in $\mathbb{R}^{2}$ of length one. The classical "worm problem" of L. Moser from 1966 asks for the least area covered by the curves in any Moser family. In 1979, J. M. Marstrand proved that the answer is not zero: the union of curves in a Moser family has always area at least $c$ for some small absolute constant $c > 0$. We strengthen Marstrand's result by showing that for $p > 3$, the $p$-modulus of a Moser family of curves is at least $c_{p} > 0$.

General MathematicsTHIN SETModulusconformal modulus01 natural sciencesThin setpotential theoryCombinatoricsNull set010104 statistics & probabilityPlanarCIRCLESMathematics - Metric GeometryClassical Analysis and ODEs (math.CA)FOS: Mathematics111 Mathematics0101 mathematicsAbsolute constantMathematicsMoser familyApplied Mathematicsta111010102 general mathematicsMathematical analysisZero (complex analysis)Metric Geometry (math.MG)28A75 (Primary) 31A15 60CXX (Secondary)measure theoryMathematics - Classical Analysis and ODEsFamily of curvespotentiaaliteoriamittateoriaMEASURE ZEROcurve packing problems
researchProduct

Salkowski curves revisited: A family of curves with constant curvature and non-constant torsion

2009

In the paper [Salkowski, E., 1909. Zur Transformation von Raumkurven, Mathematische Annalen 66 (4), 517-557] published one century ago, a family of curves with constant curvature but non-constant torsion was defined. We characterize them as space curves with constant curvature and whose normal vector makes a constant angle with a fixed line. The relation between these curves and rational curves with double Pythagorean hodograph is studied. A method to construct closed curves, including knotted curves, of constant curvature and continuous torsion using pieces of Salkowski curves is outlined.

Mathematical analysisAerospace EngineeringDifferential geometry of curvesCurvatureComputer Graphics and Computer-Aided DesignConstant curvatureParametric surfaceModeling and SimulationFundamental theorem of curvesTorsion of a curveAutomotive EngineeringFamily of curvesConstant (mathematics)MathematicsComputer Aided Geometric Design
researchProduct

Mechanical and electrical behavior of human muscle during maximal concentric and eccentric contractions

1974

The force-velocity relationships of human muscle (e.g., Asmussen, Hansen, and Lammert, 1965; Komi, 1973a) characterize the main mechanical differences in concentric and eccentric work. Some information also has been reported on the interrelationship between neural input and mechanical output during submaximal concentric and eccentric contractions. The slope of the regression line representing the relationship between IEMG and muscle tension is greater when muscle shortens at a constant velocity than when it lengthens at the same velocity (Bigland and Lippold, 1954). When recordings were made with a greater number of velocities, then a family of curves was obtained, a result which emphasizes…

PhysicsHuman muscleTension (physics)Muscle tensionFamily of curvesWork (physics)EccentricEccentric contractionsMechanicsConcentric
researchProduct

A Property on Singularities of NURBS Curves

2002

We prove that if a.n open Non Uniform Rational B-Spline curve of order k has a singular point, then it belongs to both curves of order k - 1 defined in the k - 2 step of the de Boor algorithm. Moreover, both curves are tangent at the singular point.

Pure mathematicsSingularityFamily of curvesCurve fittingTangentGeometryGravitational singularitySingular point of a curveNon-uniform rational B-splineDe Boor's algorithmMathematics::Numerical AnalysisMathematics
researchProduct